Recent advances in parallel kinetic Monte Carlo: synchronous sublattice algorithm
نویسندگان
چکیده
Abstract. An efficient, semi-rigorous synchronous algorithm for parallel kinetic Monte Carlo simulations is presented. The accuracy and parallel efficiency are studied as a function of processor size, number of processors, and the ratio D/F of monomer hopping rate (D) to deposition rate (F ) for two different simple models of epitaxial growth. Since only local communication is required, the algorithm scales, i.e. for a large number of processors the parallel efficiency is independent of the number of processors.
منابع مشابه
Semirigorous synchronous sublattice algorithm for parallel kinetic Monte Carlo simulations of thin film growth
The standard kinetic Monte Carlo algorithm is an extremely efficient method to carry out serial simulations of dynamical processes such as thin film growth. However, in some cases it is necessary to study systems over extended time and length scales, and therefore a parallel algorithm is desired. Here we describe an efficient, semirigorous synchronous sublattice algorithm for parallel kinetic M...
متن کاملBillion-atom Synchronous Parallel Kinetic Monte Carlo Simulations of Critical 3D Ising Systems
An extension of the synchronous parallel kinetic Monte Carlo (pkMC) algorithm developed by Martinez et al [J. Comp. Phys. 227 (2008) 3804] to discrete lattices is presented. The method solves the master equation synchronously by recourse to null events that keep all processors time clocks current in a global sense. Boundary conflicts are rigorously solved by adopting a chessboard decomposition ...
متن کاملA derivation and scalable implementation of the synchronous parallel kinetic Monte Carlo method for simulating long-time dynamics
KineticMonte Carlo (KMC) simulations are used to study long-time dynamics of awide variety of systems. Unfortunately, the conventional KMC algorithm is not scalable to larger systems, since its time scale is inversely proportional to the simulated system size. A promising approach to resolving this issue is the synchronous parallel KMC (SPKMC) algorithm, which makes the time scale size-independ...
متن کاملSynchronous parallel kinetic Monte Carlo for continuum diffusion-reaction systems
A novel parallel kinetic Monte Carlo (kMC) algorithm formulated on the basis of perfect time synchronicity is presented. The algorithm is intended as a generalization of the standard w-fold kMC method, and is trivially implemented in parallel architectures. In its present form, the algorithm is not rigorous in the sense that boundary conflicts are ignored. We demonstrate, however, that, in thei...
متن کاملSynchronous relaxation algorithm for parallel kinetic Monte Carlo simulations of thin film growth.
We present an optimistic synchronous relaxation algorithm for parallel kinetic Monte Carlo (KMC) simulations of thin film growth. This algorithm is based on spatial decomposition of the KMC lattice and it employs two measures aimed at improving the parallel efficiency: dynamic global updating and domain boundary shifting. We utilize this algorithm to simulate two different growth models, which ...
متن کامل